High Speed Modulo Calculation Algorithm with Radix-2k SD Number

نویسندگان

  • Masaaki Niimura
  • Yasushi Fuwa
چکیده

In RSA Cryptograms, many modulo calculations are used, but modulo calculation is based on many subtractions and it takes long time to calculate. In this article, we explain about a new modulo calculation algorithm using table. And we proof that upper 3 digits of Radix-2k SD numbers is enough to specify the answer. In the first section, we prepared some useful theorems for operations of Radix-2k SD Number. In the second section, we defined Upper 3 Digits of Radix-2k SD number and proved that property. In the third section, we proved some property about the minimum digits of Radix-2k SD number. In the fourth section, we identified the range of modulo arithmetic result and proved that the Upper 3 Digits indicate two possible answers. And in the last section, we defined a function to select true answer from the results of Upper 3 Digits.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Magnitude Relation Properties of Radix-2k SD Number

In this article, magnitude relation properties of Radix-2k SD number are discussed. Until now, the Radix-2k SD Number is proposed for the high-speed calculations for RSA Cryptograms. In RSA Cryptograms, many modulo calculations are used, and modulo calculations need a comparison between two numbers. In this article, we discussed about a magnitude relation of Radix-2k SD Number. In the first sec...

متن کامل

High-Speed Algorithms for RSA Cryptograms

In this article, we propose a new high-speed processing method for encoding and decoding the RSA cryptogram that is a kind of public-key cryptogram. This cryptogram is not only used for encrypting data, but also for such purposes as authentication. However, the encoding and decoding processes take a long time because they require a great deal of calculations. As a result, this cryptogram is not...

متن کامل

An Algorithm for Magnitude Comparison in RNS based on Mixed-Radix Conversion II

The residue number system (RNS) has computational advantages for large integer arithmetic because of its parallel carry free, and high-speed arithmetic nature. However, magnitude comparison is a very complex operation for RNS. This paper presents a new comparison algorithm based on the modification of Mixed-Radix Conversion II technique. The new algorithm uses small modulo operations only and h...

متن کامل

Design and Synthesis of High Speed Low Power Signed Digit Adders

Signed digit (SD) number systems provide the possibility of constant-time addition, where inter-digit carry propagation is eliminated. Such carry-free addition is primarily a three-step process; adding the equally weighted SDs to form the primary sum digits, decomposing the latter to interim sum digits and transfer digits, which commonly belong to {–1, 0, 1}, and finally adding the tra...

متن کامل

Low-Power Radix-8 Booth Encoded Modulo 2n − 1 Multiplier with Adaptive Delay

A special moduli set Residue Number System (RNS) of high dynamic range (DR) can speed up the execution of very-large word-length repetitive multiplications found in applications like public key cryptography. The modulo 2n − 1 multiplier is usually the noncritical datapath among all modulo multipliers in such high-DR RNS multiplier. This timing slack can be exploited to reduce the system area an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004